A QZ-method based on semiseparable matrices
نویسندگان
چکیده
منابع مشابه
A bibliography on semiseparable matrices
Currently there is a growing interest in semiseparable matrices and generalized semiseparable matrices. As it is interesting to know the historical evolution of this concept, we present in this paper an extensive list of publications related to the field of semiseparable matrices. It is interesting to see that semiseparable matrices were investigated in different fields, e.g. integral equations...
متن کاملGegenbauer Polynomials and Semiseparable Matrices
In this paper, we develop a new O(n logn) algorithm for converting coefficients between expansions in different families of Gegenbauer polynomials up to a finite degree n. To this end, we show that the corresponding linear mapping is represented by the eigenvector matrix of an explicitly known diagonal plus upper triangular semiseparable matrix. The method is based on a new efficient algorithm ...
متن کاملA note on the representation and definition of semiseparable matrices
In this paper the definition of semiseparable matrices is investigated. Properties of the frequently used definition and the corresponding representation by generators are deduced. Corresponding to the class of tridiagonal matrices another definition of semisepar-able matrices is introduced preserving the nice properties dual to the class of tridiagonal matrices. Several theorems and properties...
متن کاملEfficient Scalable Algorithms for Hierarchically Semiseparable Matrices
Hierarchically semiseparable (HSS) matrix algorithms are emerging techniques in constructing the superfast direct solvers for both dense and sparse linear systems. Here, we develope a set of novel parallel algorithms for the key HSS operations that are used for solving large linear systems. These include the parallel rank-revealing QR factorization, the HSS constructions with hierarchical compr...
متن کاملEfficient Parallel Algorithms for Hierarchically Semiseparable Matrices
Recently, hierarchically semiseparable (HSS) matrices have been used in the development of fast direct sparse solvers. Key applications of HSS algorithms, coupled with multifrontal solvers, appear in solving certain large-scale computational inverse problems. Here, we develop massively parallel HSS algorithms appearing in these solution methods, namely, parallel HSS construction using the rank ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2008
ISSN: 0377-0427
DOI: 10.1016/j.cam.2007.07.032